Pointed binary encompassing trees: Simple and optimal
نویسندگان
چکیده
For n disjoint line segments in the plane we construct in optimal O(n log n) time an encompassing tree of maximal degree three such that every vertex is pointed. Moreover, at every segment endpoint all incident edges lie in a halfplane defined by the incident input segment.
منابع مشابه
Pointed Encompassing Trees
It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-trian...
متن کاملPointed Binary Encompassing Trees
We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v ∈ T is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follo...
متن کاملEmbedding of Complete and Nearly Complete Binary Trees into Hypercubes
A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented.
متن کاملCommunications in Binary Fat Trees
Fat trees are built around complete b-ary trees but have processing nodes only at the leaf level and may have different branch capacities in different levels. In this paper we study the communication capabilities of binary fat trees (including the simple binary tree) with respect to five major communication operations: broadcasting, multinode broadcasting, scattering, gathering and total exchan...
متن کاملThe estimated cost of a search tree on binary words
The problem of constructing a binary search tree for a set of binary words has wide applications in computer science, biology, mineralogy, etc. Shannon considered a similar statement in his optimal coding theorem. It is NP-complete to construct a tree of minimum cost [4]; therefore, the problem arises of finding simple algorithms for constructing nearly optimal trees. We show in this correspond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 43 شماره
صفحات -
تاریخ انتشار 2005